labeled tree造句

when the constraint of unique labeling is removed, the ordered labeled tree becomes the objective
当取消了标号唯一性限定后，论文解决了有序标号树中的模式发现问题。
the algorithm transforms the traditional tree-to-tree correction into the comparing of the key trees, which are substantially label trees without duplicate paths . thus, the algorithm achieves high efficiency with the complexity of o ( n ), where n is the total number of nodes in the trees, which is significant to the large scaled applications
为适应大规模应用的需要，本文提出了直接利用特征路径进行文档比较的kf-diff+算法，同时适于有序和无序两种模式，在时间复杂度上从先前的o(nlogn)提高到o(n)，更加适合internet规模的应用。
It's difficult to find labeled tree in a sentence. 用labeled tree造句挺难的